Optimality of SCS watermarking
نویسندگان
چکیده
Blind spread-spectrum watermarking schemes with correlation based detection algorithms suffer significantly from host signal interference. Improvements are possible when considering the host signal as side-information to the watermark encoder. Costa showed that, in a specific case, host signal interference can be avoided completely. The scalar Costa scheme, which operates on structured codebooks based on scalar quantizers, performs relatively close to the ideal Costa scheme in terms of maximum rate of reliable communication (capacity) over a channel with AWGN attack. The concept of amplitude limited channels in conjunction with repetition of the signal constellation is also known in the communications community by the name modulo channel, which has been studied into great detail. Starting from the modulo channel, which implies a constraint on the amplitude in the receiver, we model the watermarking scenario based on scalar quantizers. The capacity of this model is presented and compared to the theoretical results for SCS watermarking in the case of AWGN attacks. A final analysis of SCS in terms of optimality, based on the results with the modulo channel, shows that even binary SCS is near optimum for one-dimensional (symbol-by-symbol) embedding in terms of capacity for an i.i.d. Gaussian host signal and an appropriate AWGN attack. c ©2003 by SPIE and IS&T. This paper will be published in Proceedings of SPIE Vol. 5020, Security and Watermarking of Multimedia
منابع مشابه
Analysis and Improving the Security of the Scalar Costa Scheme against Known Message Attack
Unintentional attacks on watermarking schemes lead to degrade the watermarking channel, while intentional attacks try to access the watermarking channel. Therefore, watermarking schemes should be robust and secure against unintentional and intentional attacks respectively. Usual security attack on watermarking schemes is the Known Message Attack (KMA). Most popular watermarking scheme with stru...
متن کاملPerformance of a practical blind watermarking scheme
In many blind watermarking proposals, the unwatermarked host data is viewed as unavoidable interference. Recently, however, it has been shown that blind watermarking corresponds to communication with side information (i.e., the host data) at the encoder. For a Gaussian host data and Gaussian channel, Costa showed that blind watermarking can theoretically eliminate all interference from the host...
متن کاملÈööóöññò Óó Èöö Blockinøø Blockin Blockinð Ððòò Ïøøöññöööòò Ë Blockinññ
In many blind watermarking proposals, the unwatermarked host data is viewed as unavoidable interference. Recently, however, it has been shown that blind watermarking corresponds to communication with side information (i.e., the host data) at the encoder. For a Gaussian host data and Gaussian channel, Costa showed that blind watermarking can theoretically eliminate all interference from the host...
متن کاملA Channel Model for Watermarks Subject to Desynchronization Attacks
One of the most important practical problems of blind Digital Watermarking is the resistance against desynchronization attacks, one of which is the Stirmark random bending attack in the case of image watermarking. Recently, new blind digital watermarking schemes have been proposed which do not suffer from host-signal interference. One of these quantization based watermarking scheme is the Scala...
متن کاملDesynchronization Attacks on Watermarks
Digital watermarking is used for the copyright protection of multimedia documents like image. One problem in it is the desynchronization attacks of the watermark at the receiver. Here a channel model for watermark reception with non perfect synchronization is introduced. Under the given channel model the capacity of SCS water marking and imperfectly synchronized reception is derived. One import...
متن کامل